A Method of Resolving an Entangled Cord

We often see entangled cords in our daily life. Entangled cords need to be resolved and put in order to handle them conveniently or to keep their quality in a good situation. In order to resolve an entangled cord, mutual relation must be made clear in advance among areas of the cord. In this paper, a technique is presented for analyzing mutual connection among the areas of an entangled cord. A given image of a cord is separated into cord areas and each of the areas is represented by a list of edge pixels. The lists are analyzed to find a unique path from one end of a given cord to the other end. Experimental results employing real cord images are shown. labeling is reported [2,3]. They employ disconnection relation among cord areas and represent it in terms of a consistent labeling problem to find a solution. In order to resolve an entangled cord, mutual relation must be made clear in advance among areas of the cord. In the technique proposed here, a given image of an entangled cord is separated into each cord area and the cord area is described by a list of the pixels which compose the edge of the cord area. Employing the lists, the given entangled cord is analyzed to find a unique path from one end of the cord to the other end. Performance of the proposed technique is experimentally evaluated. 2. Definitions and Assumptions